Generalized n-gons and Chebychev polynomials

VERY HOMOGENEOUS GENERALIZED n-GONS OF FINITE MORLEY RANK

(Almost strongly minimal) generalized n-gons are constructed for all n& 3 for which the automorphism group acts transitively on the set of ordered ordinary (n­1)-gons contained in it, a new class of BN-pairs thus being obtained. Through the construction being modified slightly, 2! many non-isomorphic almost strongly minimal generalized n-gons are obtained for all n& 3, none of which interprets ...

Chebychev polynomials in a speech recognition model

Advanced speech mformatlon processmg systems require further research on speakerdependent mformatlon Recently, a specific system of discrete orthogonal polynomials {4:(l), 1 = 1,2, ,L },“=, has been encountered to play a dommant role m a segmental probability model recently proposed m the speaker-dependent feature extra&on from speech waves and apphed to text-independent speaker verlficatlon He...

On Inducing n-gons

In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.

Isotemporal Classes of N-gons

FRACTAL n-GONS AND THEIR MANDELBROT SETS

We consider self-similar sets in the plane for which a cyclic group acts transitively on the pieces. Examples like n-gon Sierpiński gaskets, Gosper snowflake and terdragon are well-known, but we study the whole family. For each n our family is parametrized by the points in the unit disk. Due to a connectedness criterion, there are corresponding Mandelbrot sets which are used to find various new...